Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs
نویسندگان
چکیده
منابع مشابه
Improved bounds for the shortness coefficient of cyclically 4-edge connected cubic graphs and snarks
We present a construction which shows that there is an infinite set of cyclically 4-edge connected cubic graphs on n vertices with no cycle longer than c4n for c4 = 12 13 , and at the same time prove that a certain natural family of cubic graphs cannot be used to lower the shortness coefficient c4 to 0. The graphs we construct are snarks so we get the same upper bound for the shortness coeffici...
متن کاملCyclically five-connected cubic graphs
A cubic graph G is cyclically 5-connected if G is simple, 3–connected, has at least 10 vertices and for every set F of edges of size at most four, at most one component of G\F contains circuits. We prove that if G and H are cyclically 5-connected cubic graphs and H topologically contains G, then either G and H are isomorphic, or (modulo well-described exceptions) there exists a cyclically 5-con...
متن کاملTutte's 5-flow conjecture for highly cyclically connected cubic graphs
In 1954, Tutte conjectured that every bridgeless graph has a nowherezero 5-flow. Let ω be the minimum number of odd cycles in a 2-factor of a bridgeless cubic graph. Tutte’s conjecture is equivalent to its restriction to cubic graphs with ω ≥ 2. We show that if a cubic graph G has no edge cut with fewer than 5 2ω − 1 edges that separates two odd cycles of a minimum 2-factor of G, then G has a n...
متن کاملSuper Cyclically Edge Connected Half Vertex Transitive Graphs
Tian and Meng in [Y. Tian and J. Meng, c -Optimally half vertex transitive graphs with regularity , Information Processing Letters 109 (2009) 683-686] shown that a connected half vertex transitive graph with regularity and girth is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree k k 6 g G ...
متن کاملA Note on Arboricity of 2-edge-connected Cubic Graphs
The vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set of vertices of G can be partitioned so that each subset induces a forest. It is well known that a(G) ≤ 3 for any planar graph G, and that a(G) ≤ 2 for any planar graph G of diameter at most 2. The conjecture that every planar graph G without 3-cycles has a vertex partition (V1, V2) such that V1 is an ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/8440